Distributed Fair Scheduling with Variable Transmission Lengths
نویسندگان
چکیده
The fairness of 802.11 wireless networks is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling algorithm that we call VLS, for “variable-length scheduling”, that provides weighted fairness to all stations despite the imperfections of the MAC layer and physical channels. Distinct features of VLS include the utilization of variable transmission lengths based on distributed observations, compatibility with 802.11’s contention window algorithm, opportunistic scheduling to achieve high throughput under noisy and time-varying wireless channel conditions, and flexibility and ease of implementation.
منابع مشابه
Distributed Fair Scheduling with Variable Transmission Lengths in IEEE 802.11 Wireless Networks
The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling al...
متن کاملDistributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling al...
متن کاملDelay controlled proportional fair scheduling in Rayleigh fading wireless channel
In this study, the authors consider a delay control problem with proportional fair scheduling in time-varying wireless channels. For proportional fairness of transmission rates among users, a congestion control scheme is proposed for guaranteeing both throughput and delay of the wireless network. Specifically, a scheduling weight is introduced to control queue lengths without degrading the thro...
متن کاملA Constant Complexity Fair Scheduler with O(log N) Delay Guarantee
Many Internet multimedia applications require the support of network services with fairness and delay guarantees. Currently, there are two types of fair schedulers in the literature. The time stamp based schedulers achieve good fairness and delay guarantees but have high O(log N) time complexity, where N is the number of incoming flows. While the round robin based schedulers reach O(1) complexi...
متن کاملFair Scheduling in an Optical Interconnection Network
Existing fair scheduling schemes have focused primarily on scheduling multiple ows to a single output. The limited work that has focused on scheduling multiple ows to multiple outputs has assumed a non-blocking, slotted-time, cell-based network with a centralized controller. This paper presents a fair scheduler suitable for use in bu erless circuit-switched blocking networks operating with dist...
متن کامل